Measurement Based Interference Models for Wireless Scheduling Algorithms

نویسندگان

  • Helga Gudmundsdottir
  • Eyjólfur Ingi Ásgeirsson
  • Marijke H. L. Bodlaender
  • Joseph T. Foley
  • Magnús M. Halldórsson
  • Geir M. Järvelä
  • Henning Úlfarsson
  • Ymir Vigfusson
چکیده

Modeling physical layer behavior of packet reception in the presence of interference is central to achieving efficient spectrum use in wireless sensor networks via spatial reuse. On one hand, analytic and simulations research has largely relied on assumptions of geometric path loss and isotropic transmission which have not been borne out in experiments. Experimental research, on the other hand, has not adopted theoretical models and instead focused on measuring the reality on the ground. We propose a new framework for wireless algorithms. First, distance-based path loss is replaced by an arbitrary gain matrix, typically obtained by measurements of received signal strength (RSS). This allows for the modeling of complex environments, e.g., with obstacles and walls. Second, a new parameter ζ indicates how close the gain matrix is to a distance metric, effectively measuring the complexity of the environment. We experimentally validate our framework on two indoors testbeds with 20 and 60 motes. The results validate the basic properties of the model, the predictive ability of packet reception, dominance over distance-based models, and the sensitivity of ζ to the nature of the environment. Theoretically, we show that all known SINR scheduling algorithms that work in general metric spaces carry over and achieve equivalent performance guarantees in the new model. The conclusions suggest that wireless theory can finally be grounded in experimental practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assessment of DSACC and QPART Algorithms in Ad Hoc Networks

The rapid advancement in wireless over wired has augmented the need for improving theQuality of Service (QoS) over such wireless links. However, the wireless ad hoc networkshave too low bandwidth, and establishing a QoS in these networks is a difficult issue. So,support of quality of service in ad hoc networks is the topical issue among the networkscience researchers. In this research we are go...

متن کامل

Computational complexity and scheduling algorithms for wireless networks

The main problem studied in this thesis is that of scheduling communication requests in a wireless network. Given a set of wireless links, comprised by sender and receiver nodes, distributed in an arbitrary manner in space, we want to know how much time it takes until all the links are scheduled successfully. This problem is a fundamental part of the more general problem of determining the thro...

متن کامل

Provable Algorithms for Joint Optimization of Transport, Routing and MAC layers in Wireless Ad Hoc Networks

Given a wireless network and a collection of source-destination pairs {(si, ti)}, what is the maximum end-to-end rate (throughput) at which the network can transfer data from the sources to their corresponding destinations? The problem is nontrivial to solve in the case of wireless networks due to interference. It is additionally complicated when taking into account TCP like transport protocols...

متن کامل

Capacity Characterization of Multi-Hop Wireless Networks- A Cross Layer Approach

A fundamental problem in multi-hop wireless networks is to estimate their throughout capacity. The problem can be informally stated as follows: given a multi-hop wireless network and a set of source destination pairs, determine the maximum rate r at which data can be transmitted between each source destination pair. Estimating the capacity of a multi-hop wireless network is practically useful —...

متن کامل

On High Spatial Reuse Broadcast Scheduling in STDMA Wireless Ad Hoc Networks

Graph-based algorithms for point-to-multipoint broadcast scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise density Ratio (SINR) at intended receivers, leading to low throughput. To overcome this problem, we propose a new algorithm for STDMA broadcast schedul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1401.1723  شماره 

صفحات  -

تاریخ انتشار 2013